A New Algorithm for the Euclidean k-Bottleneck Steiner Problem
نویسندگان
چکیده
We consider the problem of adding a fixed number of relays to a WSN in order to minimise the length of the longest transmission edge. Since routing subnetworks are often trees we model the problem as a Euclidean k-bottleneck Steiner tree problem (k-BSTP). We then propose a new iterative approximation algorithm for the k-BSTP, based on an exact solution to the 1-BSTP, and compare our heuristic (via simulation) to the currently best performing heuristic in the literature, namely the minimum spanning tree heuristic (MSTH). We observe that our algorithm performs up to 8% better than MSTH on uniformly distributed node-sets.
منابع مشابه
Fast Approximation Algorithm for Restricted Euclidean Bottleneck Steiner Tree Problem
Bottleneck Steiner tree problem asks to find a Steiner tree for n terminals with at most k Steiner points such that the length of the longest edge in the tree is minimized. The problem has applications in the design of wireless communication networks. In this paper we study a restricted version of the bottleneck Steiner tree problem in the Euclidean plane which requires that only degree-2 Stein...
متن کاملAn approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane
We study a bottleneck Steiner tree problem: given a set P = {p1,p2, . . . , pn} of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in the design of wireless communication networks. We give a ratio-1.866 approximation algorithm for the pr...
متن کاملAn Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem
Given two sets of points in the plane, P of n terminals and S of m Steiner points, a Steiner tree of P is a tree spanning all points of P and some (or none or all) points of S. A Steiner tree with length of longest edge minimized is called a bottleneck Steiner tree. In this paper, we study the Euclidean bottleneck Steiner tree problem: given two sets, P and S, and a positive integer k ≤ m, find...
متن کاملOn Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
We study the Euclidean bottleneck Steiner tree problem: given a set P of n points in the Euclidean plane, called terminals, find a Steiner tree with at most k Steiner points such that the length of the longest edge in the tree is minimized. This problem is known to be NP-hard even to approximate within ratio √ 2. We focus on finding exact solutions to the problem for a small constant k. Based o...
متن کاملAn Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem
Given two sets of points in the plane, P of n terminals and S of m Steiner points, a Steiner tree of P is a tree spanning all points of P and some (or none or all) points of S. A Steiner tree with length of longest edge minimized is called a bottleneck Steiner tree. In this paper, we study the Euclidean bottleneck Steiner tree problem: given two sets, P and S, and a positive integer k ≤ m, find...
متن کامل